Dynamic Preference Aggregation under Preference Changes

We consider the issue of update in settings for preference aggregation under preference changes. While the traditional problem formulation of preference aggregation assumes a fixed set of preference orders and a fixed set of domain elements we investigate how an aggregated preference order has to be updated when the input orders are dynamic. Our analysis shows that for even for some simple aggregation rules, i. e. for the plurality and the Borda rule, the dynamic setting can be handled more efficiently than recomputing the aggregated preference order from scratch when changes have to be made.